A STUDY ON DISTANCE OF FUZZY GRAPH THEORY

Graph theory is one of the parts of current Mathshaving encountered a most noteworthy advancement lately. The theory of fuzzy graphs was created by in the year 1975. During a similarand have additionally presented different connectedness ideas in fuzzy graphs. Fuzzy set theory gives us not just an important and ground-breaking portrayal of measurement of vulnerabilities, yet an increasingly reasonable portrayal of dubious ideas communicated in natural languages. A few properties of unusual hubs, fringe hubs and focal hubs are gotten. The scientific implanting of ordinary set theory into fuzzy has become a natural marvel. Therefore the possibility of fluffiness is an improving one. This Research study analyzes the distancetotal conceptthat is a measurement, in a fuzzy graph is presented

DOMINATION AND DOMATIC NUMBER OF A GRAPH

A dominating set of a graph G = (V, E) may be a subset D of V. such every vertex not in D is adjacent to some vertex in D. The domatic number d(G) of G is that the maximum positive integer K. such V are often partitioned into K pairwise disjoint dominating sets. the aim of this paper is to review the domatic numbers and domination numbers of a graphs that are obtained from small graphs by performing graph operations

AN STUDY ON FUZZY COLORING APPROACH

The field of Maths assumes an indispensable job in different fields.Graph theory is asignificant zonein Maths, utilized for several models. An old style graph speaks to an old style connection among objects. The items are spoken to by vertices & relations by edges. Coloring of Graph is a considered issue of combinatorial streamlining. Theory of F-graphs has various applications in current science & innovation, particularly in neural networksfields, information theory, cluster analysis, expert systems, control theory, medical diagnosis, etc. In 1975Rosenfeldpresented the concept of F-graphs. The coloring of F-graphshas a few applications in reality. Graph coloring fills in as a model for compromise in issues of combinatorial improvement. F-graphsColoring has some genuine combinatorial streamlining applications issues as exam schedule, allocation registration, systemof traffic light, and so forth. The most significant issue in the coloring issue of the F-graphis to develop a strategy for finding F-graphschromatic numbers. In this Article, we analyzed Coloring Approach in Fuzzy Graph Theory